Lagrange interpolation on subgrids of tensor product grids

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lagrange interpolation on subgrids of tensor product grids

This note shows that a wide class of algebraically motivated constructions for Lagrange interpolation polynomials always yields a tensor product interpolation space as long as the nodes form a tensor product grid or a lower subset thereof.

متن کامل

A Note on Tensor Product of Graphs

Let $G$ and $H$ be graphs. The tensor product $Gotimes H$ of $G$ and $H$ has vertex set $V(Gotimes H)=V(G)times V(H)$ and edge set $E(Gotimes H)={(a,b)(c,d)| acin E(G):: and:: bdin E(H)}$. In this paper, some results on this product are obtained by which it is possible to compute the Wiener and Hyper Wiener indices of $K_n otimes G$.

متن کامل

On Multivariate Lagrange Interpolation

Lagrange interpolation by polynomials in several variables is studied through a finite difference approach. We establish an interpolation formula analogous to that of Newton and a remainder formula, both of them in terms of finite differences. We prove that the finite difference admits an integral representation involving simplex spline functions. In particular, this provides a remainder formul...

متن کامل

On Boundedness of Lagrange Interpolation

We estimate the distribution function of a Lagrange interpolation polynomial and deduce mean boundedness in Lp; p < 1: 1 The Result There is a vast literature on mean convergence of Lagrange interpolation, see [4{ 8] for recent references. In this note, we use distribution functions to investigate mean convergence. We believe the simplicity of the approach merits attention. Recall that if g : R...

متن کامل

Adaptive Tensor Product Grids for Singular Problems

We consider piecewise polynomial approximation of order M in N-dimensions with a tensor product partition of the space. We assume that the partition is to be chosen to minimize ------'the-maximum----em>r---in-the-approximation.------1be---optimal---Iate---gf--cgrwetgence-foyieGeWisef--------polynomial approximation to a smooth function for unconstrained partitions is known to be order ~/N where...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 2003

ISSN: 0025-5718,1088-6842

DOI: 10.1090/s0025-5718-03-01557-6